public class Leetcode {
}

//leetcode:309:买股票的最佳时机含冷冻期
class Solution1 {
    public int maxProfit(int[] prices) {
        int n = prices.length;
        int[][] dp = new int[n][3];
        //设立三个状态0：买入, 1 : 冷冻期 , 2 :卖出
        dp[0][0] = -prices[0];
        for(int i = 1; i < n; i++){
            dp[i][0] = Math.max(dp[i-1][0],dp[i-1][1]-prices[i]);
            dp[i][1] = Math.max(dp[i-1][1],dp[i-1][2]);
            dp[i][2] = dp[i-1][0] + prices[i];
        }
        return Math.max(dp[n-1][1],dp[n-1][2]);
    }
}

class Solution2 {
    public int maxProfit(int[] prices, int fee) {
        int n = prices.length;
        //设立两个状态0:有票 1：没有票
        int[][] dp = new int[n][2];
        dp[0][0] = -prices[0];
        for(int i = 1; i < n; i++){
            dp[i][0] = Math.max(dp[i-1][1] - prices[i],dp[i-1][0]);
            dp[i][1] = Math.max(dp[i-1][0]+prices[i]-fee,dp[i-1][1]);
        }
        return dp[n-1][1];
    }
}